Two bounds on the noncommuting graph

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounds on the restrained Roman domination number of a graph

A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...

متن کامل

Exponential Bounds for Noncommuting Systems

It is shown that a nite system T of matrices whose real linear combinations have real spectrum satisses a bound of the form ke ihT;;i k C(1 + jj) s e rj=j. The proof appeals to the monogenic functional calculus.

متن کامل

groups for which the noncommuting graph is a split graph

the noncommuting graph $nabla (g)$ of a group $g$ is asimple graph whose vertex set is the set of noncentral elements of$g$ and the edges of which are the ones connecting twononcommuting elements. we determine here, up to isomorphism, thestructure of any finite nonabeilan group $g$ whose noncommutinggraph is a split graph, that is, a graph whose vertex set can bepartitioned into two sets such t...

متن کامل

Bounds on the Distance Two-Domination Number of a Graph

For a graph G = (V , E), a subset D V ðGÞ is said to be distance two-dominating set in G if for each vertex u 2 V D, there exists a vertex v 2 D such that dðu; vÞ 2. The minimum cardinality of a distance two-dominating set in G is called a distance twodomination number and is denoted by c2ðGÞ. In this note we obtain various upper bounds for c2ðGÞ and characterize the classes of graphs attaining...

متن کامل

Bounds on First Reformulated Zagreb Index of Graph

The first reformulated Zagreb index $EM_1(G)$ of a simple graph $G$ is defined as the sum of the terms $(d_u+d_v-2)^2$ over all edges $uv$ of $G .$ In this paper, the various upper and lower bounds for the first reformulated Zagreb index of a connected graph interms of other topological indices are obtained.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Open Mathematics

سال: 2015

ISSN: 2391-5455

DOI: 10.1515/math-2015-0027